Computing information rates of finite state models with application to magnetic recording

نویسنده

  • Dieter-Michael Arnold
چکیده

The topics of this thesis are the mathematical models of the magnetic recording channel and their ultimate information-theoretic limit, the capacity. Source and channel of a magnetic recording system can be represented by a single finitestate model (FSM). The joint source/channel FSM is fully specified by the state-transition probabilities of the source model and the output probability distribution. In our case, this distribution is a parameterized Gaussian mixture density. We focus on aperiodic and irreducible FSMs whose state and observation process are stationary and ergodic. Thus, by the ShannonMcMillan-Breiman theorem, the entropy rates of the state and the observation process are determined by the probability of a typical sequence of those processes. A new and practical method is presented for computing estimates of lower and upper bounds (information rates) on the capacity of FSMs. The pivotal observation behind the method is that the entropy rate of the channel output can be computed by standard forward sum-product trellis processing of simulated or (in principle) measured channel output data. The method is applied to various FSMs representing the magnetic recording channel. These models are (generalized) partial-response polynomials with additive white Gaussian noise (AWGN), sources with run-length limit constraints observed through AWGN, FSMs that are trained on synthetically generated waveforms (microtrack model) with continuous mixture noise including medium noise, and the binary jitter channel with discrete-valued data-dependent noise.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Three-dimensional calculations of the magnetic fields in a finite superconducting hollow cylinder in an applied axial magnetic field

In this study, a set of self-consistent coupled-integral equations for the local magnetic flux and current distributions in a finite superconducting hollow cylinder under an axial magnetic field has been directly derived by using the Biot-Savart law within the framework of the critical-state model. The equations were first solved numerically in the three-dimensional space before obtaining the h...

متن کامل

Finite Element Method Application in Analyzing Magnetic Fields of High Current Bus Duct

The goal of paper is to present the magnetic field calculations in high current bus ducts. Finiteelement method is used to do this. Bus ducts under study have figure such as circle area. Thecalculations will be using mathematical relations, meshed geometric shape and analyzing them.Geometric mean will help us to determine the value of magnetic field. COMSOL software is appliedfor simulation stu...

متن کامل

Application of Soft Computing Methods for the Estimation of Roadheader Performance from Schmidt Hammer Rebound Values

Estimation of roadheader performance is one of the main topics in determining the economics of underground excavation projects. The poor performance estimation of roadheader scan leads to costly contractual claims. In this paper, the application of soft computing methods for data analysis called adaptive neuro-fuzzy inference system- subtractive clustering method (ANFIS-SCM) and artificial  neu...

متن کامل

Algorithms for Computing Limit distributions of Oscillating Systems with Finite Capacity

We address the batch arrival  systems with finite capacity under partial batch acceptance strategy where service times or rates oscillate between two forms according to the evolution of the number of customers in the system. Applying the theory of Markov regenerative processes and resorting to Markov chain embedding, we present a new algorithm for computing limit distributions of the number cus...

متن کامل

Asymptotic algorithm for computing the sample variance of interval data

The problem of the sample variance computation for epistemic inter-val-valued data is, in general, NP-hard. Therefore, known efficient algorithms for computing variance require strong restrictions on admissible intervals like the no-subset property or heavy limitations on the number of possible intersections between intervals. A new asymptotic algorithm for computing the upper bound of the samp...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003